• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ILP ±â¹ÝÇÑ ½Ã°£¹Î°¨³×Æ®¿öÅ© ½ºÄÉÁÙ »ý¼º
¿µ¹®Á¦¸ñ(English Title) ILP-based Schedule Synthesis of Time-Sensitive Networking
ÀúÀÚ(Author) ±èÁøÇö   ÃÖÇö¿µ   ±è°æÈÆ   ÀÌÀμ·   ±è¼¼ÈÆ   Jin Hyun Kim   Hyonyoung Choi   Kyong Hoon Kim   Insup Lee   Se-Hoon Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 48 NO. 06 PP. 0595 ~ 0603 (2021. 06)
Çѱ۳»¿ë
(Korean Abstract)
ÃֽŠ½Ç½Ã°£ ÀÌ´õ³Ý Ç¥ÁØÀÎ IEEE 802.1Qbv ½Ã°£¹Î°¨³×Æ®¿öÅ©(Time Sensitive Network, ÀÌÇÏ TSN)´Â ½ºÆ®¸²ÀÇ ½Ã°£Àû Á¤È®¼ºÀ» º¸ÀåÇϱâ À§ÇØ °í¾ÈµÈ ³×Æ®¿öÅ©ÀÇ Ç¥ÁØÀÌ´Ù. TSNÀº °øÀå ÀÚµ¿È­³ª ÀÚµ¿Â÷ ³×Æ®¿öÅ© ½Ã½ºÅÛÀ» ´ëüÇÒ ÀÌ´õ³Ý ±â¹Ý ³×Æ®¿öÅ©·Î ÇöÀç °³¹ßµÇ°í ÀÖ´Ù. TSNÀº ¿ÀÇÁ¶óÀÎ »ó¿¡¼­ ¸¸µé¾îÁø ½ºÄÉÁÙ¿¡ ±Ù°ÅÇÏ¿© ½ºÆ®¸²ÀÇ È帧À» Á¦¾îÇÔÀ¸·Î½á ÁÖ¾îÁø ½ºÆ®¸²ÀÇ Á¾´Ü°£Áö¿¬ ȤÀº ÁöÅÍ ¿ä±¸»çÇ×À» ¸¸Á·½Ãų ¼ö ÀÖ´Ù. ÇÏÁö¸¸ TSN ½ºÄÉÁÙ »ý¼ºÀº NP-hard ¹®Á¦·Î ±× º¹Àâµµ¿¡ À־ ¸Å¿ì Ç®±â¾î·Á¿î ¹®Á¦ÀÌ´Ù. ±×·¯ÇÑ ÀÌÀ¯·Î ÃÖ±Ù¿¡´Â SMT(Satisfiability Modulo Theory)À̳ª ILP(Integer Linear Programming) °°Àº Á¦¾à»çÇ× ÇØ°á ±â¹ý(Constraint solving technique) µîÀÌ ÇØ°á¹æ¹ýÀ¸·Î Á¦½ÃµÇ°í ÀÖ´Ù. ÀÌ ³í¹®¿¡¼­´Â ¿ÀÇÁ¶óÀÎ »ó¿¡¼­ÀÇ »ý¼ºÇÏ´Â TSN ½ºÄÉÁÙ »ý¼ºÀ» À§ÇØ ÈÞ¸®½ºÆ½°ú ILP¸¦ ÇÔ²² ÀÌ¿ëÇÑ Å½¿åÀûÀ̸ç Á¡ÁõÀûÀÎ(greedy and incremental) ¾Ë°í¸®ÁòÀ» Á¦°øÇÑ´Ù. ÀÌ·¸°Ô ÇÏ¿© °è»ê º¹Àâµµ¸¦ ÁÙÀÌ°í ½ºÄÉÁÙ »ý¼º ¼º´ÉÀ» ³ôÀÌ°íÀÚ ÇÑ´Ù. º» ³í¹®¿¡¼­´Â ƯÈ÷ ±âÁ¸ÀÇ SMT ¼Ö¹ö¸¦ ÅëÇÑ Á¢±Ù°úÀÇ ºñ±³¸¦ ÅëÇØ º» ¿¬±¸¿¡¼­ Á¦½ÃÇÏ´Â ¹æ¹ý¿¡ ´ëÇÑ ¼º´ÉÀ» ºñ±³ÇÑ´Ù
¿µ¹®³»¿ë
(English Abstract)
IEEE 802.1Qbv Time Sensitive Network (TSN), the latest real-time Ethernet standard, is a network designed to guarantee the temporal accuracy of streams. TSN is an Ethernet-based network system that is actively being developed for the factory automation and automobile network systems. TSN controls the flow of data streams based on schedules generated statically off-line to satisfy end-to-end delay or jitter requirements. However, the generation of TSN schedules is an NP-hard problem; because of this, constraint solving techniques, such as SMT (Satisfiability Modulo Theory) and ILP (Integer Linear Programming), have mainly been proposed as solutions to this problem. This paper presents a new approach using a heuristic greedy and incremental algorithm working with ILP to decrease the complexity of computing schedules and improve the schedule generation performance in computing TSN schedules. Finally, we compare our proposed method with the existing SMT solver approach to show the performance of our approach.
Å°¿öµå(Keyword) ½Ã°£¹Î°¨³×Æ®¿öÅ·   ½Ç½Ã°£ ½Ã½ºÅÛ   ½ºÄÉÁÙ¸µ   Time-Sensitive Networking   real-time systems   scheduling   ILP  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå